Picture languages with array rewriting rules

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tile rewriting grammars and picture languages

Tile Rewriting Grammars (TRG) are a new model for defining picture languages. A rewriting rule changes a homogeneous rectangular subpicture into a isometric one tiled with specified tiles. Derivation and language generation with TRG rules are similar to contextfree grammars. A normal form and some closure properties are presented. We prove this model has greater generative capacity than the Til...

متن کامل

Picture languages: Tiling systems versus tile rewriting grammars

Two formal models of pictures, i.e., 2D languages are compared: Tiling Systems and Tile Rewriting Grammars, which resp. extend to 2D the Regular and Context-Free languages. Two results extending classical language properties into 2D are proved. First, non-recursive TRG coincide with TS. Second, non-self-embedding TRG are suitably defined as corner grammars, showing that they generate TS languag...

متن کامل

Adjunct Hexagonal Array Token Petri Nets and Hexagonal Picture Languages

Adjunct Hexagonal Array Token Petri Net Structures (AHPN) are recently introduced hexagonal picture generating devices which extended the Hexagonal Array Token Petri Net Structures . In this paper we consider AHPN model along with a control feature called inhibitor arcs and compare it with some expressive hexagonal picture generating and recognizing models with respect to the generating power.

متن کامل

Rewriting declarative query languages

Queries against databases are formulated in declarative languages. Examples are the relational query language SQL and XPath or XQuery for querying data stored in XML. Using a declarative query language, the querist does not need to know about or decide on anything about the actual strategy a system uses to answer the query. Instead, the system can freely choose among the algorithms it employs t...

متن کامل

Learning Plan Rewriting Rules

Considerable work has been done to automatically learn domain-specific knowledge to improve the performance of domain independent problem solving systems. However, most of this work has focussed on learning search control knowledge-knowledge that can be used by a problem solving system during search to improve its performance. An alternative approach to improving the performance of domain indep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1973

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(73)90573-1